Developing a New Java Algorithm for Playing Backgammon
نویسندگان
چکیده
A computer game is a very convenient way of recreation. In order to simulate most classical games, many algorithms have been implemented. The complexity of algorithms used in implementing the games leads to a continuous increasing of the computer performance. The application presented in this paper is able to play backgammon. The software allows a game between two players and also a game between one player and the computer. A software package module allows monitoring games in the network. All software programs were implemented in Java language. Keywords— Heuristic algorithms, computer games, backgammon, java..
منابع مشابه
Achieving Efficient and Cognitively Plausible Learning in Backgammon
Traditionally, computer applications to game domains have taken a brute-force approach, relying on sheer computational power to overcome the complexity of the domain. Although many of these programs have been quite successful, it is interesting to note that humans can still perform extremely well against them. Thus we are compelled to ask, if no human could match the computational power of most...
متن کاملAnyGammon: Playing backgammon variants using any board size
In this paper we describe AnyGammon, a program that extends the casual board game of backgammon to different board sizes while retaining the familiar game rules. Small board sizes make it easier to analyze algorithms and game evaluation functions. Large board sizes make the original games more challenging and interesting for the players. Finally, we demonstrate how ancient, forgotten variants o...
متن کاملProgramming backgammon using self-teaching neural nets
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD-Gammon’s selfteaching methodology results in a surprisingly strong program: without lookahead, its positional judgement rivals that of human experts, and when combined with shallow lookahead, it reaches a level of pla...
متن کاملTDLeaf( ): Combining Temporal Difference Learning with Game-Tree Search
ABSTRACT In this paper we present TDLeaf( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with minimax search. We present some experiments in both chess and backgammon which demonstrate its utility and provide comparisons with TD( ) and another less radical variant, TDdirected( ). In particular, our chess program, “KnightCap,” used TDLeaf( ) to learn its evaluati...
متن کاملTDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search
In this paper we present TDLeaf(λ), a variation on the TD(λ) algorithm that enables it to be used in conjunction with minimax search. We present some experiments in both chess and backgammon which demonstrate its utility and provide comparisons with TD(λ) and another less radical variant, TD-directed(λ). In particular, our chess program, " KnightCap, " used TDLeaf(λ) to learn its evaluation fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012